Power diagram depth sorting
نویسندگان
چکیده
In this paper we propose a new approach to the depth sorting problem. Given a simplicial complex ? in IE d , our approach is based on the preliminary construction of a convex complex ? in IE d+1 , whose projection on IE d corresponds to ?, and on the representation of ? as a power diagram. This approach exhibits a O(m log m) runtime complexity to sort a simplicial complex with m cells and requires only linear storage.
منابع مشابه
Synthesis of Parallel Sorting Networks using SAT Solvers
Sorting networks are implementations of parallel sorting algorithms that have many important applications like routing where they are more powerful than other networks like the Omeganetwork [Law75]. Sorting networks are essentially combinational hardware circuits that consist of only compare/exchange modules. While a recursive definition of an asymptotically optimal sorting network is known [AK...
متن کاملOptimal Distribution System Reconfiguration Using Non-dominated Sorting Genetic Algorithm (NSGA-II)
In this paper, a Non-dominated Sorting Genetic Algorithm-II (NSGA-II) based approach is presented for distribution system reconfiguration. In contrast to the conventional GA based methods, the proposed approach does not require weighting factors for conversion of multi-objective function into an equivalent single objective function. In order to illustrate the performance of the proposed method,...
متن کاملDepth Optimized Efficient Homomorphic Sorting
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is obtained by focusing on the multiplicative depth of the sorting circuit alongside the more traditional metrics such as number of comparisons and number of iterations. The reduced depth allows much reduced noise growth and thereby makes it possible to select smaller param...
متن کاملLow Depth Circuits for Efficient Homomorphic Sorting
We introduce a sorting scheme which is capable of efficiently sorting encrypted data without the secret key. The technique is obtained by focusing on the multiplicative depth of the sorting circuit alongside the more traditional metrics such as number of comparisons and number of iterations. The reduced depth allows much reduced noise growth and thereby makes it possible to select smaller param...
متن کاملSorting Networks: The Final Countdown
In this paper we extend the knowledge on the problem of empirically searching for sorting networks of minimal depth. We present new search space pruning techniques for the last four levels of a candidate sorting network by considering only the output set representation of a network. We present an algorithm for checking whether an n-input sorting network of depth d exists by considering the mini...
متن کامل